Sufficient Conditions for Global Minimality of Metastable States in a Class of Non-Convex Functionals: a Simple Approach via Convex Lower Bounds

نویسندگان

  • David Shirokoff
  • Rustum Choksi
  • Jean-Christophe Nave
چکیده

We consider mass-constrained minimizers for a class of non-convex energy functionals involving double-well potentials. Based upon global convex lower bounds to the energy, we introduce a simple strategy to find sufficient conditions on a given critical point (metastable state) to be a global minimizer. We show that this strategy works well for the one exact and known metastable state: the constant state. In doing so, we numerically derive an almost optimal lower bound for both the order-disorder transition curve of the Ohta-Kawasaki energy and the liquid-solid interface of the Phase Field Crystal energy. We discuss how this strategy extends to non-constant computed metastable states, and the resulting symmetry issues which one must overcome. We give a preliminary analysis of these symmetry issues by addressing the global optimality of a computed lamellar structure for the Ohta-Kawasaki energy in one (1D) and two (2D) space dimensions, and on a two dimensional, asymmetric, flat torus. We also consider global optimality of a non-constant state for a spatially inhomogenous perturbation of the Ohta-Kawasaki energy. Finally we use one of our simple convex lower bounds to rigorously prove that for certain values of the Ohta-Kawasaki parameter and aspect ratio of an asymmetric flat torus, any global minimizer v(x) for the 1D problem is automatically a global minimizer for the 2D problem on the asymmetric torus.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sufficient Conditions for Global Minimality of Metastable States in a Class of Non-convex Functionals: A Simple Approach Via Quadratic Lower Bounds

We consider mass-constrained minimizers for a class of non-convex energy functionals involving a double-well potential. Based upon global quadratic lower bounds to the energy, we introduce a simple strategy to find sufficient conditions on a given critical point (metastable state) to be a global minimizer. We show that this strategy works well for the one exact and known metastable state: the c...

متن کامل

Inequalities of Ando's Type for $n$-convex Functions

By utilizing different scalar equalities obtained via Hermite's interpolating polynomial, we will obtain lower and upper bounds for the difference in Ando's inequality and in the Edmundson-Lah-Ribariv c inequality for solidarities that hold for a class of $n$-convex functions. As an application, main results are applied to some operator means and relative operator entropy.

متن کامل

Existence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials 

Introduction Let  be a nonempty subset of a normed linear space . A self-mapping  is said to be nonexpansive provided that  for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...

متن کامل

Convex combinations of harmonic shears of slit mappings

‎In this paper‎, ‎we study the convex combinations of harmonic mappings obtained by shearing a class of slit conformal mappings‎. ‎Sufficient conditions for the convex combinations of harmonic mappings of this family to be univalent and convex in the horizontal direction are derived‎. ‎Several examples of univalent harmonic mappings constructed by using these methods are presented to illustrate...

متن کامل

Global convergence of an inexact interior-point method for convex quadratic‎ ‎symmetric cone programming‎

‎In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014